| 1. | Router chooses next hop toward destination
路由器选择一个更接近目标的下一跳 |
| 2. | Internet2 next hop resolution protocol , nhrp
下一个网路节点解析协定 |
| 3. | Next hop resolution protocol , nhrp
下一个网络节点解析协议 |
| 4. | Mac address of next hop determined
下一跳的 |
| 5. | If that next hop is congested , the packet can be delayed inside the router
如果下一站不能接受新的包，则他们就一直停留在这个路由器上。 |
| 6. | Router delays : packets are re - assembled when received by routers and buffered in memory until they can be transmitted on the next hop
路由延迟：包被路由器接收后重新组装并保存在缓冲区中直到他们发送到下一站。 |
| 7. | The genetic algorithm with load balance can solve routing problem and can be applied in mobile ip and next hop route . chapter 4 collaborates on routing problem via a designated node . due to the excellent performance in nondeterministic polynomial problem , such as tsp , we choose the genetic algorithm to implement triangle routing in mobile ip protocol
本文第三章提出了基于矩阵编码的遗传算法的最低费用的下一跳路由，解决浙江大学博士学位论文了下一跳路由中不考虑网络负载和时延可能产生拥塞的问题，优化了网络的性能，使得网络中的带宽得到合理分配。 |
| 8. | This paper focuses on the following research work : 1 . proposes a genetic algorithm based on matrix encoding for next hop route with load and time delay ; 2 . proposes a genetic algorithm for shortest route via designated node , solves the problem which dijkastra algorithm need two times or more to compute ; 3 . proposes a scheme of dividing populations and dividing time in order to improve the success ratio ; 4 . proposes a network model for directional motion , performs evaluation for mobile ip based on wlan , and concludes some useful results
提出了解决移动ip中过指定点的路由的遗传算法，解决了dijkstra算法需要分次计算的问题，通过记录遗传算法的叠代结果还可以给出次优解路由； 3引入了分群和分周期的操作策略，对过指点最短路由的遗传算法进行了改进，仿真分析表明使用该遗传算法求解过指定点的路由获得了比inagaki算法更高的成功率； 4 |
